Tropically Convex Constraint Satisfaction
نویسندگان
چکیده
منابع مشابه
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition, the basic operations of path-consistency algorithms. This establishes that path consistency over CRC constraints produces a minimal and decomposable network and is thus a polynomial-time decision procedure for CRC ne...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction , Constraint Programming
Recently constraint satisfaction has been embedded in various high-level declarative programming environments, like the Constraint Logic Programming framework, and even more recently such environments have been extended with concurrency, like in the Concurrent Constraint Programming paradigm. The merging of diierent areas of research is always an exciting event, and proliic of new ideas. We bel...
متن کاملConstraint Satisfaction
A constraint satisfaction problem (csp) de ned over a constraint network consists of a nite set of variables, each associated with a domain of values, and a set of constraints. A solution is an assignment of a value to each variable from its domain such that all the constraints are satis ed. Typical constraint satisfaction problems are to determine whether a solution exists, to nd one or all so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2017
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-017-9762-0